Fast Approximate Dct : Basic { Idea , Error Analysis
نویسندگان
چکیده
The discrete cosine transform (DCT) has a variety of applications in image and speech processing. The idea of the subband{DFT (SB{DFT) [1], [2] is applied in [3] to the DCT. In this paper the basic idea of the SB{DCT is discussed which is based on subband decomposition of the input sequence. Approximation is done by discarding the computations of bands of little energy. The complexity of this fast approximate method is examined in comparing it with a fast cosine{transform method [4] in terms of program running-time. New accurate analysis of the errors due to the approximation is presented for any number of decomposition stages. New applications of the SB{DCT in speech cepstrum analysis and in echo detection are also included by using the SB{DCT instead of the full{band FFT in calculating the real and complex cepstra.
منابع مشابه
Error-Free Computation of 8x8 2-D DCT and IDCT Using Two-Dimensional Algebraic Integer Quantization
previously published scalar quantization algorithm [3], This paper presents a novel error-free (infinite-precision) architecture for the fast implementation of both 2-D Discrete Cosine Transform and Inverse DCT. The architecture uses a new algebraic integer quantization of a 1-D radix-8 DCT that allows the separable computation of a 2D DCT without any intermediate number representation conversi...
متن کاملClosed loop optimization of image coding using subjective error criteria
This paper proposes a closed-loop optimization framework to improve image coding efficiency by searching DCT coefficients at the equivalent subjective quality to original coding result. The proposed framework shares a basic idea currently adopted in speech coding that searches optimal codes in closed-loop operation, evaluating the coded signal with perceptually weighted mean square error. To ev...
متن کاملModified Approximate Dct for Image Compression Using Efficient Binary Adder
Image processing became a big challenge in the multimedia usage for processing the images with low power and high efficiency. For processing images, DCT (Discrete cosine transforms) are utilized for compression because of its advantages over the energy consumption. In existing methods, they used Approximate DCT with fast algorithm and regular pipelining structure for reducing the design complex...
متن کاملEarly Determination of Zero-Quantized 8 , ×, 8 DCT Coefficients
This paper proposes a novel approach to early determination of zero-quantized 8× 8 discrete cosine transform (DCT) coefficients for fast video encoding. First, with the dynamic range analysis of DCT coefficients at different frequency positions, several sufficient conditions are derived to early determine whether a prediction error block (8× 8) is an all-zero or a partial-zero block, i.e., the ...
متن کاملA new multiplierless discrete cosine transform based on the Ramanujan ordered numbers for image coding
The performance of image coding can be improved upon by using a special class of multiplierless discrete cosine transform using Ramanujan numbers termed as Ramanujan DCT (RDCT). Ramanujan ordered numbers are those which approximate 2π/N by 2 2 l m − − + , where l and m are integers. The cosine angles can then be computed using Chebyshev type of recursion using only shifters and adders. Fast for...
متن کامل